Polynomial-Time Solutions of Computational Problems in Noncommutative-Algebraic Cryptography
نویسندگان
چکیده
منابع مشابه
Polynomial time cryptanalysis of noncommutative-algebraic key exchange protocols
We introduce the linear centralizer method for a passive adversary to extract the shared key in group-theory based key exchange protocols (KEPs). We apply this method to obtain a polynomial time cryptanalysis of the Commutator KEP, introduced by Anshel–Anshel–Goldfeld in 1999 and considered extensively ever since. We also apply this method to the Centralizer KEP, introduced by Shpilrain–Ushakov...
متن کاملUnivariate polynomial solutions of algebraic difference equations
Contrary to linear difference equations, there is no general theory of difference equations of the form G(P (x − τ1), . . . , P (x − τs)) + G0(x)=0, with τi ∈ K, G(x1, . . . , xs) ∈ K[x1, . . . , xs] of total degree D ≥ 2 and G0(x) ∈ K[x], where K is a field of characteristic zero. This article is concerned with the following problem: given τi, G and G0, find an upper bound on the degree d of a...
متن کاملAlgebraic adjoint of the polynomials-polynomial matrix multiplication
This paper deals with a result concerning the algebraic dual of the linear mapping defined by the multiplication of polynomial vectors by a given polynomial matrix over a commutative field
متن کاملThe role of algebraic solutions in planar polynomial differential systems . ∗
We study a planar polynomial differential system, given by ẋ = P (x, y), ẏ = Q(x, y). We consider a function I(x, y) = exp{h2(x)A1(x, y) A0(x, y)} h1(x) ∏l i=1(y − gi(x))i , where gi(x) are algebraic functions of x, A1(x, y) = ∏r k=1(y − ak(x)), A0(x, y) = ∏s j=1(y − g̃j(x)) with ak(x) and g̃j(x) algebraic functions, A0(x, y) and A1(x, y) do not share any common factor, h2(x) is a rational functi...
متن کاملPolynomial-time Word Problems
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these results follow from observing that automorphisms of the free group strongly resemble straight line programs, which are widely studied in the theory of compressed d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Cryptology
سال: 2013
ISSN: 0933-2790,1432-1378
DOI: 10.1007/s00145-013-9170-9